Sequent Calculi and Bidirectional Natural Deduction: On the Proper Basis of Proof-theoretic Semantics

نویسنده

  • Peter Schroeder-Heister
چکیده

Philosophical theories of logical reasoning are intrinsically related to formal models. This holds in particular of Dummett–Prawitz-style proof-theoretic semantics and calculi of natural deduction. Basic philosophical ideas of this semantic approach have a counterpart in the theory of natural deduction. For example, the “fundamental assumption” in Dummett’s theory of meaning (Dummett, 1991, p. 254 and Ch. 12) corresponds to Prawitz’s formal result that every closed derivation can be transformed into introduction form (Prawitz, 1965, p. 53). Examples from other areas in the philosophy of logic support this claim. If conceptual considerations are genetically dependent on formal ones, we may ask whether the formal model chosen is appropriate to the intended conceptual application, and, if this is not the case, whether an inappropriate choice of a formal model motivated the wrong conceptual conclusions. We will pose this question with respect to the paradigm of natural deduction and proof-theoretic semantics, and plead for Gentzen’s sequent calculus as a more adequate formal model of hypothetical reasoning. Our main argument is that the sequent calculus, when philosophically re-interpreted, does more justice to the notion of assumption than does natural deduction. This is particularly important when it is extended to a wider field of reasoning than just that based on logical constants. To avoid confusion, a terminological caveat must be put in place: When we talk of the sequent calculus and the reasoning paradigm it represents, we mean, as its characteristic feature, its symmetry or bidirectionality, i.e.,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof-Theoretic Methods in Nonclassical Logic — an Introduction

This is an introduction to proof theory of nonclassical logic, which is directed at people who have just started the study of nonclassical logics, using proof-theoretic methods. In our paper, we will discuss only its proof theory based on sequent calculi. So, we will discuss mainly cut elimination and its consequences. As this is not an introduction to sequent systems themselves, we will assume...

متن کامل

An Adjunction-Theoretic Foundation for Proof Search in Intuitionistic First-Order Categorical Logic Programming

In this thesis we compose a proof-theoretic approach to logic programming with a category-theoretic approach to proof theory. This allows us to present the computation mechanisms of several systems of logic programming as proof search strategies within an intuitionistic first-order sequent calculus with logic variables and to analyze aspects of their behavior algebraically. Beginning from the b...

متن کامل

Machine - Assisted Meta - Theory of Sequent - StyleCalculi

A formalisation of the implicational fragments of two sequent calculi and a sequent-style presentation of natural deduction in Coq is presented. The systems presented are all typed lambda calculi. Based on this formalisation, some general comments on the feasibility of performing meta-theoretic proofs about typed lambda calculi in a proof assistant based on higher-order type theory are made. Co...

متن کامل

A Proof Theoretic Approach to Operational Semantics

Proof theory can be applied to the problem of specifying and reasoning about the operational semantics of process calculi. We overview some recent research in which λ-tree syntax is used to encode expressions containing bindings and sequent calculus is used to reason about operational semantics. There are various benefits of this proof theoretic approach for the π-calculus: the treatment of bin...

متن کامل

A Unified Compilation Style Labelled Deductive System for Modal and Substructural Logic using Natural Deduction

This paper describes a proof theoretic and semantic approach in which logics belonging to different families can be given common notions of derivability relation and semantic entailment. This approach builds upon Gabbay’s methodology of Labelled Deductive Systems (LDS) and it is called the compilation approach for labelled deductive systems (CLDS). Two different logics are here considered, (i) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009